Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic
نویسندگان
چکیده
منابع مشابه
Proof Nets Construction and Automated Deduction in Non-commutative Linear Logic -extended Abstract
Proof nets can be seen as a multiple conclusion natural deduction system for Linear Logic (LL) and form a good formalism to analyze some computation mechanisms, for instance in type-theoretic interpretations. This paper presents an algorithm for automated proof nets construction in the non-commutative multiplicative linear logic that is useful for applications including planning, concurrency or...
متن کاملProof nets Construction and Automated Deduction in Non-Commutative Linear Logic
Proof nets can be seen as a multiple conclusion natural deduction system for Linear Logic (LL) and form a good formalism to analyze some computation mechanisms, for instance in type-theoretic interpretations. This paper presents an algorithm for automated proof nets construction in the non-commutative multiplicative linear logic that is useful for applications including planning, concurrency or...
متن کاملFocusing and Proof - Nets in Linear and Non - Commutative LogicJean -
Linear Logic 4] has raised a lot of interest in computer research, especially because of its resource sensitive nature. One line of research studies proof construction procedures and their interpretation as computational models, in the \Logic Programming" tradition. An eecient proof search procedure, based on a proof normaliza-tion result called \Focusing", has been described in 2]. Focusing is...
متن کاملNatural Deduction for Intuitionistic Non-Commutative Linear Logic
We present a system of natural deduction and associated term calculus for intuitionistic non-commutative linear logic (INCLL) as a conservative extension of intuitionistic linear logic. We prove subject reduction and the existence of canonical forms in the implicational fragment. We also illustrate by means of an example how the proof term calculus can be employed in the setting of logical fram...
متن کاملConstraint Based Proof Construction in Non-Commutative Logic
This work presents a computational interpretation of the construction process for cyclic (CyLL) and noncommutative (NL) sequential proofs. We assume a proof construction paradigm, based on a normalization procedure, known as focussing which manages eÆciently the non-determinism of the construction. Similarly to the linear case, a new formulation of focussing for NL is used to introduce a genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)01179-5